ON THE CONJUGACY PROBLEM IN CERTAIN METABELIAN GROUPS
نویسندگان
چکیده
منابع مشابه
On the Conjugacy Problem in Certain Metabelian Groups
We analyze the computational complexity of the conjugacy search problem in a certain family of metabelian groups. We prove that in general the time complexity of the conjugacy search problem for these groups is at most exponential. For a subfamily of groups we prove that the conjugacy search problem is polynomial. We also show that for some of these groups the conjugacy search problem reduces t...
متن کاملThe Conjugacy Problem in Wreath Products and Free Metabelian Groups
1. Introduction. The conjugacy problem was formulated by Dehn in 1912 for finitely presented groups [1]. The question was whether it can be effectively determined for such a group when two elements are conjugate. This general question was answered in the negative by Novikov in 1954 [6J. But it is still of interest to determine whether the problem is solvable for particular finitely presented gr...
متن کاملConjugacy separability of certain torsion groups
It is shown that certain torsion groups studied by Grigorchuk and by Gupta and Sidki are conjugacy separable. 1. Introduction. In [1, 2, 3], R. I. Grigorchuk introduced and studied some remarkable new examples of finitely generated torsion groups. These groups are residually finite and amenable, and they fall into 20 isomorphism classes of p-groups for each prime p. Grigorchuk solved a problem ...
متن کاملThe Conjugacy Problem in Small Gaussian Groups
Small Gaussian groups are a natural generalization of spherical Artin groups in which the existence of least common multiples is kept as an hypothesis, but the relations between the generators are not supposed to necessarily be of Coxeter type. We show here how to extend the Elrifai-Morton solution for the conjugacy problem in braid groups to every small Gaussian group.
متن کاملA Note on the Shifted Conjugacy Problem in Braid Groups
It is an open problem whether the shifted conjugacy (decision) problem in B∞ is solvable. We settle this problem by reduction to an instance of the simultaneous conjugacy problem in Bn for some n ∈ N. Recall Artin's presentation of the braid group Bn with n ≥ 2 strands [1]: Bn = 〈σ1, . . . , σn−1 | σiσj = σjσi for |i−j| ≥ 2, σiσjσi = σjσiσj for |i−j| = 1〉. The groups Bn (n ≥ 2) build an inducti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Glasgow Mathematical Journal
سال: 2018
ISSN: 0017-0895,1469-509X
DOI: 10.1017/s0017089518000198